Constructing Low%2DCost Swarm Robots That March in Column Formation.

Discovering Community%2DOriented Roles of Nodes in a Social Network.

Semi%2Dsupervised Projection Clustering with Transferred Centroid Regularization.

Topology Preserving SOM with Transductive Confidence Machine.

Semi%2Dsupervised Projection Clustering with Transferred Centroid Regularization.

Subclass%2DOriented Dimension Reduction with Constraint Transformation and Manifold Regularization.

Best papers from the 12th Pacific%2DAsia conference on knowledge discovery and data mining %28PAKDD2008%29.

Finding the k%2DMost Abnormal Subgraphs from a Single Graph.


Mining Peculiar Compositions of Frequent Substrings from Sparse Text Data Using Background Texts.




Negative Encoding Length as a Subjective Interestingness Measure for Groups of Rules.

Discovering Action Rules That Are Highly Achievable from Massive Data.

Statistical Implicative Analysis%2C Theory and Applications

Advances in Knowledge Discovery and Data Mining

Unsupervised Cross%2DDomain Learning by Interaction Information Co%2Dclustering.

Discovery Science
Introduction  Discovery has always attracted people and has been a major motiveforce  of progress in human history. It has long been discussed in the philosophyof  science but it is only after 1960&#039;s that the problem of discovery became properly addressed by new philosophy of science group  6)  . In the last two decades, there has also been a considerable progress, in the field of artificial intelligence, of a domain often considered the realm of genius - empirical discovery  5)  . Historically, discovery tends to be viewed as a difficult form of learning from observation although learning and discovery convey rather different meanings  4)  . The former suggests a gradual process, while the latter suggests a more rapid mental event, often involving some form of insight. Learning may lead to an unconscious change in knowledge, while one is always aware that a discovery has been made. The results of learning can be declarative or procedura
Pitfalls for Categorizations of Objective Interestingness Measures for Rule Discovery.

Discovery Science
Introduction  Discovery has always attracted people and has been a major motiveforce  of progress in human history. It has long been discussed in the philosophyof  science but it is only after 1960&#039;s that the problem of discovery became properly addressed by new philosophy of science group  6)  . In the last two decades, there has also been a considerable progress, in the field of artificial intelligence, of a domain often considered the realm of genius - empirical discovery  5)  . Historically, discovery tends to be viewed as a difficult form of learning from observation although learning and discovery convey rather different meanings  4)  . The former suggests a gradual process, while the latter suggests a more rapid mental event, often involving some form of insight. Learning may lead to an unconscious change in knowledge, while one is always aware that a discovery has been made. The results of learning can be declarative or procedura


Unifying Framework for Rule Semantics Application to Gene Expression Data.

Strategy Diagram for Identifying Play Strategies in Multi%2Dview Soccer Video Data.

Spiral Removal of Exceptional Patients for Mining Chronic Hepatitis Data.

Strategy Diagram for Identifying Play Strategies in Multi%2Dview Soccer Video Data.

Classification non%2Dsupervis%E9e de donn%E9es relationnelles.

DPITT Multi%2Dviewpoint Visualization System for Detecting Peculiar WWW Pages Rapidly.

An Information Theoretic Approach to Detection of Minority Subsets in Database.

Visualizing Transactional Data with Multiple Clusterings for Knowledge Discovery.

Intuitive Display for Search Engines Toward Fast Detection of Peculiar WWW Pages.

Data Mining Methods for Discovering Interesting Exceptions from an Unsupervised Table.

Sample based crowding method for multimodal optimization in continuous domain.

Mini%2DCar%2DSoccer as a testbed for granular computing.

Multi%2Dstrategy Instance Selection in Mining Chronic Hepatitis Data.

Towards Ad%2DHoc Rule Semantics for Gene Expression Data.



Unified algorithm for undirected discovery of exception rules.
Abstract. This paper presents an algorithm that seeks every possible exception rule which violates a common sense rule and satisfies several assumptions of simplicity. Exception rules, which represent systematic deviation from common sense rules, are often found interesting. Discovery of pairs that consist of a common sense rule and an exception rule, resulting from undirected search for unexpected exception rules, was successful in various domains. In the past, however, an exception rule was represented by a change of conclusion caused by adding an extra condition to the premise of a common sense rule. That approach formalized only one type of exceptions, and failed to represent other types. In order to provide a systematic treatment of exceptions, we categorize exception rules into eleven categories, and we propose a unified algorithm for discovering all of them. Preliminary results on fifteen real-world data sets provide an empirical proof of effectiveness of our algorithm in discovering interesting knowledge. The empirical results also match our theoretical analysis of exceptions, showing that the eleven types can be partitioned in three classes according to the frequency with which they occur in data.
Discovery Science
Introduction  Discovery has always attracted people and has been a major motiveforce  of progress in human history. It has long been discussed in the philosophyof  science but it is only after 1960&#039;s that the problem of discovery became properly addressed by new philosophy of science group  6)  . In the last two decades, there has also been a considerable progress, in the field of artificial intelligence, of a domain often considered the realm of genius - empirical discovery  5)  . Historically, discovery tends to be viewed as a difficult form of learning from observation although learning and discovery convey rather different meanings  4)  . The former suggests a gradual process, while the latter suggests a more rapid mental event, often involving some form of insight. Learning may lead to an unconscious change in knowledge, while one is always aware that a discovery has been made. The results of learning can be declarative or procedura
Using WWW%2DDistribution of Words in Detecting Peculiar Web Pages.

An Efficient Algorithm for Reducing Clauses Based on Constraint Satisfaction Techniques.

Undirected Exception Rule Discovery as Local Pattern Detection.

Foundations of Intelligent Systems
The aim of this paper is to introduce the theoretical foundations of an approach for intelligent systems development. Derived from semiotics, a classic discipline in human sciences, the theory developed provides a mathematical framework for the concept of knowledge and for knowledge processing. As a result, a new perspective to study and to develop intelligent systems emerges. A taxonomy of elementary types of knowledge is proposed based on the classification of types of signs in semiotics, followed by a another classification of knowledge from the point of view of application in cognitive systems. In addition, we propose the mathematical definition of objects, objects systems and objects networks, to model mathematically the different types of knowledge described. The symbiosis of such key concepts introduces a computational paradigm to develop and implement intelligent systems, called here computational semiotics. 
Experimental Evaluation of Time%2DSeries Decision Tree.

Improving Efficiency of Frequent Query Discovery by Eliminating Non%2Drelevant Candidates.

Detecting Interesting Exceptions from Medical Test Data with Visual Summarization.

Decision%2Dtree Induction from Time%2Dseries Data Based on a Standard%2Dexample Split Test.
This paper proposes a novel decision tree for a data set with time-series attributes. Our time-series tree has a value (i.e. a time sequence) of a time-series attribute in its internal node, and splits examples based on dissimilarity between a pair of time sequences. Our method selects, for a split test, a time sequence which exists in data by exhaustive search based on class and shape information. Experimental results confirm that our induction method constructs comprehensive and accurate decision trees. Moreover, a medical application shows that our time-series tree is promising for knowledge discovery.
Detecting Hostile Accesses through Incremental Subspace Clustering.



Finding an Optimal Gain%2DRatio Subset%2DSplit Test for a Set%2DValued Attribute in Decision Tree Induction.

Data Squashing for Speeding Up Boosting%2DBased Outlier Detection.

Iterative Data Squashing for Boosting Based on a Distribution%2DSensitive Distance.

In Pursuit of Interesting Patterns with Undirected Discovery of Exception Rules.

Undirected Discovery of Interesting Exception Rules.

Worst%2DCase Analysis of Rule Discovery.

Bloomy Decision Tree for Multi%2Dobjective Classification.

Issues in Organizing a Successful Knowledge Discovery Contest.

Evaluating Hypothesis%2DDriven Exception%2DRule Discovery with Medical Data Sets.

Exception Rule Mining with a Relative Interestingness Measure.
. This paper presents a method for mining exception rules  based on a novel measure which estimates interestingness relative to its  corresponding common sense rule and reference rule. Mining interesting  rules is one of the important data mining tasks. Interesting rules bring  novel knowledge that helps decision makers for advantageous actions. It is  true that interestingness is a relative issue that depends on the other prior  knowledge. However, this estimation can be biased due to the incomplete  or inaccurate knowledge about the domain. Even if possible to estimate  interestingness, it is not so trivial to judge the interestingness from a  huge set of mined rules. Therefore, an automated system is required  that can exploit the knowledge extractacted from the data in measuring  interestingness. Since the extracted knowledge comes from the data, so  it is possible to find a measure that is unbiased from the user&#039;s own  belief. An unbiased measure that can estimate the interestingn...
Unified Algorithm for Undirected Discovery of Execption Rules.

Research Topics Discovery from WWW by Keywords Association Rules.

Normal Form Transformation for Object Recognition Based on Support Vector Machines.

Scheduled Discovery of Exception Rules.

Normal Form Transformation for Object Recognition Based on Support Vector Machines.

Support Vector Machines for Knowledge Discovery.

Visualizing Discovered Rule Sets with Visual Graphs Based on Compressed Entropy Density.

Simultaneous Reliability Evaluation of Generality and Accuracy for Rule Discovery in Databases.

Discovery of Surprising Exception Rules Based on Intensity of Implication.

Autonomous Discovery of Reliable Exception Rules.

Exceptional Knowledge Discovery in Databases Based on Information Theory.

Knowledge%2DBased Handling of Design Expertise.

Knowledge%2Dbased system for computer%2Daided drug design.

Logic%2Dbased approach to expert systems in chemistry.

